Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts
نویسندگان
چکیده
We investigate how to rapidly solve an online sequence of maximum flow problems. Sequences of maximum flow problems arise in a diverse collection of settings, including stochastic network programming and real-time scheduling of jobs on a two-processor computer. In this paper, we formulate solving an online sequence of maximum flow problems as the Maximum Flow Reoptimization Problem, introduce a maximum flow algorithm designed for “warm starts,” and present computational results.
منابع مشابه
An Efficient Algorithm for Computing Robust Minimum Capacity s-t Cuts
The Minimum Capacity s-t Cut Problem (Min Cut) is an intensively studied problem in combinatorial optimization. In this paper, we study Min Cut when arc capacities are uncertain but known to exist in pre-specified intervals. This framework can be used to model many real-world applications of Min Cut under data uncertainty such as in open-pit mining or scheduling jobs on two processors. In this ...
متن کاملSolving the Bi-Objective Maximum-Flow Network-Interdiction Problem
W describe a new algorithm for computing the efficient frontier of the “bi-objective maximum-flow network-interdiction problem.” In this problem, an “interdictor” seeks to interdict (destroy) a set of arcs in a capacitated network that are Pareto-optimal with respect to two objectives, minimizing total interdiction cost and minimizing maximum flow. The algorithm identifies these solutions throu...
متن کاملImplementation of D3Q19 Lattice Boltzmann Method with a Curved Wall Boundary Condition for Simulation of Practical Flow Problems
In this paper, implementation of an extended form of a no-slip wall boundary condition is presented for the three-dimensional (3-D) lattice Boltzmann method (LBM) for solving the incompressible fluid flows with complex geometries. The boundary condition is based on the off-lattice scheme with a polynomial interpolation which is used to reconstruct the curved or irregular wall boundary on the ne...
متن کاملSolving Group Scheduling Problem in No-wait Flow Shop with Sequence Dependent Setup Times
Different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. Nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. Conventional productionmethods are constantly subs...
متن کاملSolving Group Scheduling Problem in No-wait Flow Shop with Sequence Dependent Setup Times
Different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. Nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. Conventional productionmethods are constantly subs...
متن کامل